منابع مشابه
Polymorphic Syntax Definition
Context-free grammars can be used in algebraic speciication instead of rst-order signatures to deene the structure of algebras. The rigidity of these rst-order structures enforces a choice between strongly typed structures with little gener-icity or generic operations over untyped structures. Two-level signatures provide a better balance between genericity and typing. Two-level grammars are the...
متن کاملPolymorphic Syntax Deenition
Context-free grammars are used in several algebraic speciication formalisms instead of rst-order signatures for the deenition of the structure of algebras , because grammars provide better notation than signatures. The rigidity of these rst-order structures enforces a choice between strongly typed structures with little genericity or generic operations over untyped structures. In two-level sign...
متن کاملPolymorphic Abstract Syntax via Grothendieck Construction
Abstract syntax with variable binding is known to be characterised as an initial algebra in a presheaf category. This paper extends it to the case of polymorphic typed abstract syntax with binding. We consider two variations, secondorder and higher-order polymorphic syntax. The central idea is to apply Fiore’s initial algebra characterisation of typed abstract syntax with binding repeatedly, i....
متن کاملConcrete Syntax Definition for Modeling Languages
Syntax (Metamodel) Model «conformsTo» Code Generator Templates
متن کاملPAPEL: Syntax and Semantics for Provenance-Aware Policy Definition
The processing of data is often restricted by contractual and legal requirements for protecting privacy and IPRs. Policies provide means to control how and by whom data is processed. Conditions of policies may depend on the previous processing of the data. However, existing policy languages do not provide means to express such conditions. In this work we present a formal model and language allo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00268-5